Systems and methods of directory entry encodings

ABSTRACT

In general, the invention relates to supporting multiple different character encodings in the same file system. In one embodiment, a method is provided for filename lookup that supports multiple character encodings. The method comprises storing filename data in a first character encoding into an indexed data structure. The method further comprises receiving filename data in a second encoding. The method also comprises looking up filename data in the indexed data structure using the second encoding.

LIMITED COPYRIGHT AUTHORIZATION

A portion of disclosure of this patent document includes material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyrights whatsoever.

FIELD OF THE INVENTION

The invention relates generally to directory entry encodings, and specifically, relates to supporting multiple different character encodings in the same file system.

BACKGROUND OF THE INVENTION

The increase in the amount of data stored on digital computing systems has resulted in complex storage systems. One method for organizing data has been to store them in electronic files. These files are then grouped into directories with some directories including other directories and/or files. Typically, files and directories are assigned unique identifiers within the file system. In most systems, files and directories are arranged in order to optimize the lookup of a unique identifier given the particular path or name of the file or directory.

In some circumstances, it may be desirable to provide a file system that may be accessed by client processes using multiple different character encodings. It can be problematic to provide a file system that supports access to filenames created with multiple different character encodings. Because of the foregoing challenges and limitations, there is a need to provide a file system that supports access to files named with multiple different character encodings.

SUMMARY OF THE INVENTION

The embodiments disclosed herein generally relate to providing a system that supports access to files named in multiple different character encodings. For purposes of this summary, certain aspects, advantages, and other features of the invention are described herein. It is to be understood that not necessarily all such advantages may be achieved in accordance with any particular embodiment of the invention. Thus, for example, those skilled in the art will recognize that the invention may be embodied or carried out in a manner that achieves one advantage or group of advantages as taught herein without necessarily achieving other advantages which may be taught or suggested herein.

In one embodiment, a system for filename lookup that supports multiple character encodings is provided. The system includes a module configured to store filename data in a first character encoding into an indexed data structure; to receive filename data in a second encoding; and to lookup filename data in the indexed data structure using the second encoding.

In another embodiment, a file system with filename lookup that supports multiple character encodings is provided. The file system includes an indexed data structure indexed by a value based on a first character encoding, said indexed data structure comprising a plurality of entries corresponding to respective filenames in the file system, said entries comprising an encoding tag identifying a respective second character encoding and a filename stored in the respective second character encoding.

In another embodiment, a method for filename lookup that supports multiple character encodings is provided. The method includes converting a filename from an encoding of a requester to a hashed value based on a standard encoding; navigating to entries within an indexed data structure that correspond to the hashed value; for the entries that correspond to the hashed value, comparing filename data stored in the entries to the filename; and determining the best match filename, if any, between the filenames stored in the entries and the filename.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates one embodiment of a computing system that provides a file system supporting access to files named with multiple different character encodings.

FIGS. 2A, 2B, and 2C illustrate one embodiment of a B−tree and B−tree-related data corresponding to a particular directory in a file system that supports access to files named with multiple different character encodings.

FIGS. 3A, 3B, and 3C illustrate flowcharts of embodiments of creating, opening, and listing the contents of a directory in a file system that supports access to files named with multiple different character encodings.

FIGS. 4A, 4B, 4C, 4D, and 4E illustrate flowcharts of one embodiment of looking up a filename in a directory of a file system that supports access to files named with multiple different character encodings.

FIGS. 5A-1, 5A-2, 5B, 5C, 5D, 5E, and 5F illustrate embodiments of example character encoding conversions.

These and other features will now be described with reference to the drawings summarized above. The drawings and the associated descriptions are provided to illustrate the embodiments of the invention and not to limit the scope of the invention. Throughout the drawings, reference numbers may be re-used to indicate correspondence between referenced elements. In addition, the first digit of each reference number generally indicates the figure in which the element first appears.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Systems and methods which represent one embodiment of an example application of the invention will now be described with reference to the drawings. Variations to the systems and methods which represent other embodiments will also be described. The present invention is not limited by the type of environment in which the systems and methods are used, however, and the systems and methods may be used in other environments, such as, for example, other file systems, virtual file systems, distributed systems, the Internet, the Worldwide Web, a private network for a hospital, a broadcast network for a government agency, and an internal network for a corporate enterprise, and intranet, a local area network (LAN), a wide area network (WAN), a wired network, a wireless network, and so forth. It is also recognized that in other embodiments, the systems and methods may be implemented as a single module and/or implemented in conjunction with a variety of other modules and the like. Moreover, the specific implementations described herein are set forth in order to illustrate, and not to limit, the invention. The scope of the invention is defined by the claims.

Embodiments of a file system suitable for accommodating, as described herein, the methods and systems for supporting multiple different character encodings are disclosed in U.S. patent application Ser. No. 10/007,003, titled, “SYSTEMS AND METHODS FOR PROVIDING A DISTRIBUTED FILE SYSTEM UTILIZING METADATA TO TRACK INFORMATION ABOUT DATA STORED THROUGHOUT THE SYSTEM,” filed Nov. 9, 2001 which claims priority to Application No. 60/309,803 filed Aug. 3, 2001; U.S. Pat. No. 7,146,524 entitled “SYSTEMS AND METHODS FOR PROVIDING A DISTRIBUTED FILE SYSTEM INCORPORATING A VIRTUAL HOT SPARE,” filed Oct. 25, 2002, and issued on Dec. 5, 2006; and U.S. patent application Ser. No. 10/714,326 entitled “SYSTEMS AND METHODS FOR RESTRIPING FILES IN A DISTRIBUTED FILE SYSTEM,” filed Nov. 14, 2003, which claims priority to Application No. 60/426,464, filed Nov. 14, 2002, all of which are hereby incorporated herein by reference in their entirety.

I. Overview

When a file is stored on a computer system, the user typically assigns the file a name using a character set, also known as an encoding. One well-known character encoding is the American Standard Code for Information Interchange (“ASCII”) encoding. ASCII characters are defined by a seven-bit binary number. Many file system users use character encodings beyond the normal seven-bit ASCII range. Over the years, many different methods have been developed to encode various languages. Although there have been attempts to standardize these encodings through Unicode, there remain for various technical, historical, and social reasons a very wide array of encoding standards still actively in use. Traditionally, most languages had one or more different character sets that were used on different operating systems, or simply by different customers, to represent characters important for that language. For example, in Japan, both the EUC-JP and SHIFT-JIS character sets are reasonably common. These character sets cover many of the same characters but use different byte representations for these characters. As one example, HIRAGANA letter KA is represented with the bytes [164 171] in EUC-JP, the bytes [130 169] in SHIFT-JIS, and the bytes [227 129 139] in the UTF-8 encoding of Unicode. Supporting multiple character encodings in a single file system can be problematic.

Although the embodiments herein are not specific to a distributed file system, the features of the described embodiments may be implemented in a distributed system. In general, a distributed file system includes one or more nodes. In one embodiment, a user of a client device is connected to a file system comprised of one or more physical nodes (for example, storage devices). In this embodiment, the data on each of the physical nodes is arranged according to inodes which store metadata corresponding to the respective files and directories within the file system. Typically, when a client device desires to access a specific file stored on the file system, the client device requests the file by its name and/or some other mutable identifier. The system then performs a lookup in order to identify the inode that corresponds to the requested file.

As used herein, a file is a collection of data that, in some embodiments, is stored in one or more units and is related to a file identifier or a filename. A directory, similar to a file, is a collection of data that, in some embodiments, is stored in one or more units and is related to a directory identifier or a directory name. A directory, however, is a specialized collection of data relating to elements in a file system. In one embodiment, a file system is organized in a tree-like structure. Directories are organized like the branches of trees. Directories may begin with a root directory and/or may include other branching directories. Files resemble the leaves or the fruit of the tree. Files, typically, do not include other elements of the file system, such as files and directories. In other words, files do not typically branch. However, in other embodiments, the files may branch.

The embodiments disclosed herein may be implemented using a file system that includes directories represented by a map data structure, and each map data structure may include ten, hundreds, or billions of entries. In some directory implementations, a B−tree based directory structure may improve directory lookup performance. B−tree based data structures allow the presence or absence of a filename in a directory to be determined by searching only a small portion of the entries in the directory. In particular, lookup in a B−tree based directory is O(log n) rather than O(n), where n is the number of entries in the directory.

In one embodiment, a tree-based directory may be indexed with a fixed-size hash of the filename. The hash is computed by a fixed mathematical operation over the bytes that make up the filename. In some file systems, the exact bytes of the filename may be stored in their respective tree entry. This may be problematic, however, for different file system users that are operating in environments using different conventions for encoding filenames. For example, the Windows operating system expects all filenames to be represented as Unicode strings. Unicode defines a set of mappings for how to interpret multi-byte values as corresponding to specific logical characters in most of the world's languages. On the other hand, many users of the Network File System (NFS) protocol work in environments which use different mapping tables to convert bytes to specific characters. As one example, many Japanese environments may for various reasons use a standard, such as EUC-JP, that is designed specifically to encode characters of interest when writing in Japanese. It is desirable to implement a directory structure that allows the lookup of names in one or more encodings used by customers of the file system. Furthermore, it is also desirable to implement a file system that allows a user accessing a file system with one encoding to be able to logically interpret filenames created by another user in a different encoding and access these files.

In one embodiment, a B−tree based encoding-preserving directory provides a file system with the support for multiple different character encodings. In some file systems, filenames are assumed to be in a certain encoding. In the illustrated embodiments, however, filenames are stored as submitted by the user, even though the encoding may be different. In one embodiment, the filenames are stored in the directory using the actual bytes provided by the client process, and the names are paired with respective numeric tags indicating the encoding used by the client. In one embodiment, this encoding tag is normally not visible to file system users and is generally inferred based on configurable settings for the particular access mechanism or client process (such as, for example, NFS, CIFS, FTP, HTTP, WebDAV and so forth) used to access the file system. In one embodiment, the name is converted from the accessor's encoding to Unicode, the converted name is regularized, and then the regularized version is hashed to generate a key for the B−tree. To lookup a name, the name being looked up is converted to Unicode, the converted name is regularized, the regularized name is hashed, and the resulting hash index is used to look for entries in the B−tree with the same hash value. If there is at least one corresponding entry, the names of the entries with that hash are converted to the encoding of the requesting client and string comparisons are performed with the client's filename. If there is a match, the lookup is a success. If there is no match, the lookup is a failure. Filenames and/or directories may be created, opened, and listed using the lookup operation.

II. System Architecture

FIG. 1 illustrates one embodiment of a computer system that provides a file system that supports access to files named with multiple different character encodings. File system computer 102 is accessible to client computers 104 through communication medium 106. In the illustrated embodiment, the file system is stored and executed on a single computing device, file system computer 102. In other embodiments, the file system may be a distributed file system, implemented on a plurality of computing nodes. In the illustrated embodiment, file system computer 102 may run on a personal computer, a work station, a main frame computer, a smart storage device, and so forth. If the file system is implemented as a distributed file system, the system may comprise a cluster of computing devices, such as smart storage devices, connected through a communication medium, such as a network. In the illustrated embodiment, client computers 104 include different file system access protocols, such as the Network File System (NFS), the Common Internet File System (CIFS), File Transfer Protocol (FTP), Hypertext Transfer Protocol (HTTP), and Web-based Distributed Authoring and Versioning, and or other file system access protocols. Client computers 104 may represent application processes, individual computing devices, a network of computing devices, and so forth. The communication medium 106 may be one or more networks, including, for example, the Internet, a local area network (LAN), a wide area network (WAN), a wireless network, a wired network, an intranet, and so forth.

In the illustrated embodiment, file system computer 102 comprises a processor 152, a storage device 154 for the file system data, and a multiple encoding module 160 and other file system modules 162. Storage device 154 comprises inodes 156 and B−trees 158. These data structures are components of the multiple encoding file system. In the illustrated embodiment, inodes 156 are metadata structures used to locate, monitor, and/or manipulate files and directories within the file system. An inode is a data structure that describes a file or directory and may be stored in a variety of locations, including on long term storage and/or in system memory. An in-memory inode may include a copy of data stored in long term storage plus additional data used by the system, including fields associated with the data structure. Although the illustrated embodiment describes a file system that includes inodes to locate, monitor, and/or manipulate file and directory data within the file system, in other embodiments other data structures may be used. In some embodiments, files and directories may be located, monitored, and/or manipulated without the use of data structures such as inodes.

In one embodiment, the storage device 154 also stores a mapping data structure for the inodes that corresponds to a directory in a file system. In the illustrated embodiment, the mapping data structure is implemented using a B−tree structure. Thus, data storage device 154 stores B−trees 158. It will be appreciated by one skilled in the art that other data structures may be used, such as, for example, B+trees, Patricia tries, red-black trees, and/or flat-file directories. In some embodiments, the data structures are ordered data structures and, in other embodiment, the data structures are unordered. Furthermore, in some embodiments, the data structures support efficient lookup, such as O(log n) efficiency, and, in other embodiments, the data structures support less efficient lookup, such as O(n) efficiency. Different combinations of order and efficiency are also possible. Thus, the data structures may, for example, be ordered and support either efficient lookup or less efficient lookup. Moreover, the data structures may be unordered and support either efficient lookup or less efficient lookup. Some data structures may even be ordered in varying degrees and/or support lookup in varying degrees of efficiencies. It will be appreciated by one skilled in the art that many suitable data structures may be used to embody features described herein.

Data structures are collections of associated data elements, such as a group or a set of variables or parameters. In one embodiment, a structure may be implemented as a C-language “struct.” One skilled in the art will appreciate that many suitable data structures may be used.

In one embodiment, the file system computer 102 may be implemented using a variety of computer systems such as, for example, a computer, a server, a smart storage unit, a mobile telephone, a handheld device, an embedded device, and so forth. In one embodiment, the computer may be a general purpose computer using one or more microprocessors, such as, for example, a Pentium® processor, a Pentium® II processor, a Pentium® Pro processor, a Pentium® IV processor, a Pentium® D processor, a Pentium® Core™ processor, an xx86 processor, an 8051 processor, a MIPS processor, a Power PC processor, a SPARC processor, an Alpha processor, and so forth. The computer may run a variety of operating systems that perform standard operating system functions such opening, reading, writing, and closing a file. It is recognized that other operating systems may be used, such as, for example, Microsoft® Windows® 3.X, Microsoft® Windows 98, Microsoft® Windows® 2000, Microsoft® Windows® NT, Microsoft® Windows® CE, Microsoft® Windows® ME, Microsoft® Windows® XP, Palm Pilot OS, Apple® MacOS®, Disk Operating System (DOS), UNIX, IRIX, Solaris, SunOS, FreeBSD, Linux®, or IBM® OS/2® operating systems.

File system modules include program instructions for operating and executing the file system. Multiple encoding module 160 includes the instructions relevant to supporting access to files named with multiple different character encodings. The other file system modules 162 include instructions for other functions of the file system. Although in the illustrated embodiment, there are multiple file system modules, in other embodiments there may be a single module, where the modules may be arranged in various suitable organizations. Furthermore, although in the illustrated embodiment, the file system modules are illustrated residing outside of data storage device 154. In other embodiments, one or more of the file system modules may be stored in whole or in part on data storage device 154 with the inodes 156 and B−trees 158.

In general, the word module, as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, C or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Moreover, although in some embodiments a module may be separately compiled, in other embodiments a module may represent a subset of instructions of a separately compiled program, and may not have an interface available to other logical program units.

III. B−Tree Data Structures

FIGS. 2A, 2B, and 2C illustrate one embodiment of a B−tree and related data corresponding to a particular directory in a file system that supports access to filenames created with multiple different character encodings. FIG. 2A illustrates one embodiment of index values for a B−tree which is a data structure that represents sorted data in a way that allows for insertion and removal of elements. B−trees are dynamic, allowing elements to be added and removed. B−trees can be multi-level data structures, comprising internal nodes that organize the data and leaf nodes that point to the stored elements in the tree. In a special type of B−tree, called a B+tree, the internal nodes include only keys (or index values) and tree pointers, which point to other nodes in the tree. All of the leaf nodes are at the same lowest level, and they are linked together as a linked list, which allows the leaves to be searched in order. To reduce the search time necessary for an in-order search of the leaf nodes, the B−tree may be traversed using the keys of the tree. Internal nodes have maximum and minimum values that define the ranges of possible key values that respective tree pointers of the internal node may point to.

FIG. 2A illustrates a table of index values for a group of elements stored in one of the B−trees of the file system. In the illustrated embodiment, the index value is a 31 bit string. The first 20 bits comprise a hash value. The hash value is determined by applying a hash function to a filename. In one embodiment, the filename transmitted by the requesting process may be translated from the encoding of the requesting process to a common encoding used by the file system. In the illustrated embodiment, the six hash values are identical. Different filenames may hash to the same value. In the illustrated embodiment, six different filenames have been hashed to the same value of 1500. The remaining 11 bits of the index (or key) comprise a counter for resolving hash collisions. In one embodiment, the counters are unique for every entry, ensuring that no index value will be identical, even though hash values may be identical. In the illustrated embodiment, the counter values range from 0 to 5. Elements in the respective B−tree are organized according to their index (or key) value. It is recognized that FIG. 2A illustrates one embodiment of an index and that other indexes of various sizes may be used with or without a counter and/or hash value. Additionally and/or alternatively, index values may be stored in a different format. Furthermore, the counter portion of the B−tree index (or key) values is not necessarily a count of entries having the same hash value. In some embodiments, the counter is the lowest unused number available for the given hash. Because directory entries may be deleted as well as added, introducing holes in the number space, in one embodiment, the counter values can be allocated in any suitable way that makes them constant for their lifetime and unique. In other words, counter values are not moved once allocated, though they may be deleted along with their respective directory entries, and they are unique values. In one embodiment, a “first-fit” algorithm is used to allocate these values; in other embodiments, other suitable algorithms may be used.

FIG. 2B illustrates a B−tree for a directory in a file system that supports multiple different character encodings. B−tree 230 is a 2-level B−tree. The internal nodes 232 organize the elements of the B−tree according to their respective index values (or keys). The leaf nodes 242 correspond to respective data elements of the B−tree. In other words, the leaf nodes organize the actual data being stored in the B−tree, and the internal nodes provide a system of lookup for the data elements stored in the leaf nodes. The internal nodes 232 are organized according to a set of ranges of index (or key) values. The top-most internal node 232 a (or the root node) divides the B−tree 230 into four different ranges: 0,0 to 1000,0 (internal node 232 b); 1000,1 to 2000,0 (internal node 232 c); 2000,1 to 3000,0 (internal node 232 d); and 3000,1 and up (internal node 232 e). Each one of these ranges corresponds to one of four internal nodes 232 in the second level of the B−tree 230. The internal nodes 232 in the second level of the B−tree 230 further divide their respective ranges into four more ranges, yielding a total of 16 ranges in the B−tree 230. For example, the internal node 232 c corresponding to the range of index (or key) values 1000,1 to 2000,0 is divided into four ranges: 1000,1 to 1236,2; 1236,3 to 1500,4; 1500,5 to 1775,0; and 1775,1 to 2000,0. B−trees are organized so that values to the left of the index are less than or equal to the index, and values to the right of the index are greater than the index.

FIG. 2C illustrates the six leaf nodes 242 corresponding to the hash value of 1500. There are six elements in the B−tree 230 corresponding to the hash value 1500. These elements correspond to filenames with hash values of 1500. Because six different filenames hash to the same value, there is a need to distinguish between the six elements in the file system. Thus, as a new element is added to the same hash bucket, it is assigned a key value corresponding to the next increment or counter. (A hash bucket is a logical grouping of all the leaf nodes and corresponding data elements that are indexed by the same hash value.) In the illustrated embodiment, the logical hash bucket for the hash value 1500 has six entries, the entries corresponding to individual filenames in the B−tree 230. These six entries span two different groups of leaf nodes 242. The first five entries 243 a are included in a different group of leaf nodes 242 than the remaining sixth entry 243 b. While the illustrated embodiment includes a counter, it is recognized that other methods of storing multiple entries may be used, such as, for example, a linked list, an array, and so forth.

There are six data elements 262 corresponding to the six leaf nodes 242. The data elements 262 comprise an encoding tag identifying the encoding of the process that requested or created the filename; a string of byte values corresponding to the native bytes of the requesting process; and a reference or address data for locating the file data associated with the respective filename. In one embodiment, the reference is a logical inode number (LSIN), which identifies the inode corresponding to the respective filename.

The leaf node 242 identified by the index (or key) value of 1500,0 corresponds to the filename “ä\”. The data element 262 a for this filename includes information regarding this filename and its associated inode. First, the data element 262 a includes an identifier for the encoding of the process that created the file. For the filename “ä\”, the encoding of the requesting process is EUC-JP. Second, the data element 262 a also includes the original byte values of the filename when the file was created, as requested by the creating process. In other words, the file system stores the original bytes of the filename as requested by the user process. Although, as discussed in further detail below, the original byte values are converted by an algorithm for indexing the filenames in the file system, the filenames themselves are stored in their original form. Thus, the data element 262 a stores the byte values [143 171 163] and [92], which are the respective byte values for “ä” and “\” in the character encoding EUC-JP. Third, the data element 262 a stores a logical inode number (LIN), which is a unique identifier for the inode corresponding to the filename associated with the respective data element 262.

Thus, the respective data elements 262 store the following data. The data element 262 b corresponding to the index (or key) value 1500,1 includes an identifier indicating that the filename was created by a process using the UTF-8 character encoding; stores the byte values [97], [204 136], and [92], which represent respectively the characters “a”, “{umlaut over ( )}”, and “\” in the UTF-8 character encoding; and stores the LIN 110. The data element 262 c corresponding to the index (or key) value 1500,2 includes an identifier indicating that the filename was created by a process using the Latin-1 character encoding; stores the byte values [228] and [165], which represent respectively the characters “ä”, and “¥” in the Latin-1 character encoding; and stores the LIN 787. The data element 262 d corresponding to the index (or key) value 1500,3 includes an identifier indicating that the filename was created by a process using the UTF-8 character encoding; stores the byte values [65], [204 136], and [92], which represent respectively the characters “A”, “{umlaut over ( )}”, and “\” in the UTF-8 character encoding; and stores the LIN 44. The data element 262 e corresponding to the index (or key) value 1500,4 includes an identifier indicating that the filename was created by a process using the UTF-8 character encoding; stores the byte values [69] and [76], which represent respectively the characters “E”, and “L” in the UTF-8 character encoding; and stores the LIN 25. The data element 262 f corresponding to the index (or key) value 1500,5 includes an identifier indicating that the filename was created by a process using the EUC-JP character encoding; stores the byte values [97], [150], and [92], which represent respectively the characters “a”, “[Invalid]” and “\” in the UTF-8 character encoding; and stores the LIN 687.

IV. Methods

FIGS. 3A, 3B, and 3C illustrate embodiments of creating, opening, and listing the contents of a directory in a file system that supports access to filenames created with multiple different character encodings. FIG. 3A illustrates a flow chart of one embodiment of creating a filename in a directory. In state 302, the multiple encoding module 160 receives a filename from a process requesting to create the filename in a particular directory. In state 304, the multiple encoding module 160 determines the encoding of the requesting process. For example, the requesting process may be a Windows client operating in the UTF-8 character encoding. Possible character encodings may include, but are not limited to, UTF-8, UTF-8-MAC, EUC-JP, EUC-JP-MS, SHIFT-JIS, LATIN-1, ASCII, and so forth. In state 306, the multiple encoding module 160 attempts to lookup the filename in the particular directory's B−tree. Although in the illustrated embodiment, the filenames within a directory are organized in a B−tree, in other embodiments, the directory's contents may be organized in other indexed data structures, such as Patricia tries, red-black trees, and/or flat-file directories. If, as determined in state 308, there is an entry already with the same filename, then a new entry is not created. In some embodiments, the multiple encoding module 160 may return a message to the requesting process indicating that the name already exists in the file system. If there is not an entry already with the same name in the file system, then the multiple encoding module 160, in state 310, creates an entry in the directory's B−tree. The entry (or element) of the B−tree stores an identifier for the encoding of the requesting process, the original byte values of the filename requested, and a reference (or address data) of the file data associated with the filename. In one embodiment, the reference is a logical inode number (LIN) which indicates the inode or metadata of the file associated with the filename. In other embodiments, the reference may be another suitable identifier or address to locate the associated file data. Furthermore, in other embodiments, the multiple encoding module 160 may allow multiple files with the same name to be stored in the B−tree and/or may append an identifier onto the name to make it unique. In addition, other file system modules may handle the creation of the file data (such as an inode) for the newly created file in the file system.

FIG. 3B illustrates a flow chart of one embodiment of requesting a reference to a file in the file system. In state 332, the multiple encoding module 160 receives a filename from a process requesting a reference, which may be a logical inode number (LIN) or some other reference of a particular file in the file system. In state 334, the multiple encoding module 160 determines the encoding of the requesting process. In state 334, the multiple encoding module 160 also determines whether an inexact match is permissible. In one embodiment, the allowable inexact matches are compatible with the regularization used to determine the respective hash value, which is described in greater detail below with reference to FIG. 4C. Thus, the multiple encoding module 160 may permit, for example, case insensitive lookups and normalization insensitive lookups. In some embodiments, the multiple encoding module 160 may additionally and/or alternatively permit an inexact match based on a list of characters that are skipped during filename comparison. This list may be access protocol specific, including, for example, NFS version 4, and so forth.

In state 336, the multiple encoding module 160 attempts to lookup the filename in the directory's B−tree. This operation is described in greater detail below with reference to FIG. 4A. If, as determined in state 338, there is an entry corresponding to the file that sufficiently matches, then the multiple encoding module 160 returns the LIN (or other reference) of the file of the sufficiently exact match, in state 340. If there is no sufficient match, then the multiple encoding module 160 does not return a LIN (or other reference). In some embodiments, the multiple encoding module 160 may return a message indicating that no sufficiently exact match for the filename was found in the file system.

FIG. 3C illustrates a flow chart of one embodiment of listing the contents of a directory. In state 360, the multiple encoding module 160 receives a LIN (or other reference) identifying a directory for which a process requests a list of associated filenames. In state 361, the multiple encoding module 160 determines the encoding of the requesting process. The states between state 362 and state 370 are repeated for the elements of the B−tree corresponding to the directory identified by the LIN (or other reference). In other words, the multiple encoding module 160 traverses the B−tree corresponding to the directory identified by the LIN (or other reference) and performs the operations described in states 364, 366, and 368. In state 364, the multiple encoding module 160 gets a LIN (or other reference) for the filename of the relevant data element. In state 366, the multiple encoding module 160 converts the filename of the relevant data element to the encoding of the requesting process. If the saved byte values for the filename include values that cannot be translated into a valid character in the encoding of the requesting process, the multiple encoding module 160 substitutes a default character, such as “#”, in place of the untranslatable byte(s). In state 368, the multiple encoding module 160 returns the converted name and the LIN (or other reference).

In other embodiments, untranslatable characters may be handled differently. For example, an escaping sequence (such as the ASCII string “\136”) may be used, in some embodiments, to note characters in such a way that the escaping can be reversed. Additionally and/or alternatively, a filename with an untranslatable character may be escaped, in some embodiments, in some arbitrary but unique manner. For example, a random filename may be returned and then remembered. Future lookup operations may check a table (such as a table of remembered, random filenames) in addition to the “real” entries. In some embodiments, the returned filename may be a combination of a hash/collision value with a random string, which may allow for the normal lookup operation (by returning a hash/collision value) while also avoiding the problem of name collision (by providing a random string).

FIGS. 4A, 4B, 4C, 4D, and 4E illustrate flowcharts of one embodiment of looking up a filename in a directory of a file system that support access to filenames created with multiple character encodings. FIG. 4A illustrates one embodiment of the overall flowchart for the lookup operation. In state 402, the multiple encoding module 160 converts the filename from the requester's encoding to a hashed value. These operations are described in more detail below with reference to FIGS. 4B and 4C. In state 404, the multiple encoding module 160 locates the entry(ies) in the directory's B−tree that corresponds to the hashed value. To locate the entry(ies) in the B−tree, the B−tree is traversed from the root node down to the leaf node(s) corresponding to the hashed value of the converted filename. If, as determined in state 406, the hashed value of the converted filename does not correspond to at least one entry in the B−tree, then the multiple encoding module 160, in state 408, returns to the requesting process a message that there is no entry with the requested filename. If, as determined in state 406, the hashed value of the converted filename does correspond to at least one entry in the B−tree, then the operations described in the states between state 410 and state 424 are repeated for the entry(ies) corresponding to the hashed value. For the operations between the states 410 and 424, the relevant entry is the current entry that the multiple encoding module 160 is performing the operations on. If, as determined in state 412, the encoding of the relevant entry is the same as the requester's encoding, then the multiple encoding module 160 proceeds to state 416. If the encoding of the relevant entry is not the same as the requester encoding, then the multiple encoding module 160, in state 414, converts the relevant entry to the requester's encoding.

If, as determined in state 416, the relevant entry matches the filename exactly, then the multiple encoding module 160 returns the relevant entry in state 418. If the relevant entry does not match the filename exactly, then the multiple encoding module 160 proceeds to state 420. If, as determined in state 420, an inexact match is wanted then the multiple encoding module 160 determines whether the relevant entry is a better match than in a previous entry(ies), and the multiple encoding module 160 remembers the best match, in state 422. If an inexact match is not wanted then the multiple encoding module 160 proceeds to the end of the operations repeated for the entry(ies) corresponding to the hash values. After the entry(ies) corresponding to the hash value have been evaluated, the multiple encoding module 160 determines whether an inexact match was found. If an inexact match was found, as determined in state 426, then the multiple encoding module 160 returns the best matching entry, in state 428. If no inexact match was found the multiple encoding module 160 returns a message indicating that no entry was found, in state 408.

FIG. 4B illustrates a flowchart of one embodiment of converting, regularizing, and hashing a filename. In state 432 the multiple encoding module 160 converts the filename provided by the requesting process to a standard encoding. For example, the standard encoding may be a Unicode encoding, such as UTF-8. If a requesting process operates in a different encoding from the standard encoding, the multiple encoding module 160 converts the filename to the standard encoding. In one embodiment, the conversion to a standard encoding is accomplished by referencing an algorithm for converting characters from a particular encoding to the standard encoding. In other embodiments, a static table or database may be used to convert character encodings. The multiple encoding module 160 remembers the original byte values for the filename, as these byte values are the byte values that are stored. Thus, the converted name is stored temporarily in memory, in one embodiment. In state 434, the multiple encoding module 160 regularizes the converted name. Embodiment of regularizing operations are discussed in greater detail below with reference to FIG. 4C. In state 436, the multiple encoding module 160 derives the index (or key) for the filename by performing a hash function on the regularized name. In one embodiment, a hash function is an algorithm that yields a value between a certain range of values. Thus, when the regularized name is “hashed” the result is a value within a range of values defined by the hash function. In the illustrated embodiment, the hash function yields a hash value between 0 and 1,048,575, corresponding to a 20 bit hash value.

FIG. 4C illustrates a flowchart of one embodiment of regularizing a converted filename. In state 438, the multiple encoding module 160 replaces problem characters. In some cases, translation between encodings is not perfect. For example, when converting a Unicode name to EUC-JP, the Unicode letters representing “\” and “¥” are converted to a single value in EUC-JP. Thus, when a filename including one of these characters is converted to EUC-JP and then converted back to Unicode, it is impossible to determine which character was used in the original Unicode string. This is called a round-trip problem and may be problematic when a user issues a read directory request to list filenames and then attempts to use the return string to open the filename. In one embodiment, this problem may be eliminated by converting all “\” and “¥” in the converted Unicode string to the “\” character. By doing so, looking up either name will return the correct hashed value. In one embodiment, the characters that cause this sort of roundtrip problem for character sets are regularized by replacing the problem characters with an identified character. In other embodiments, other regularizations may also be implemented that are useful for various lookup operations. A table of some examples of possible replacement characters is included as Appendix A, which is incorporated into this application herein.

In state 440, these lowercase characters are converted to uppercase. Because a file system may have Unicode users (in particular, Windows users) that need to lookup filenames in a case insensitive manner—for example, such that “cat” is the same as “CAT”—lowercase characters are automatically converted to uppercase characters.

In state 442, certain special characters or character strings are normalized. Some character encodings permit a character to be represented by two characters combined together. For example, there is a Unicode character “ä,”, and this character may also be represented by the characters “a” and “{umlaut over ( )}” combined. In one embodiment, the multiple encoding module 160 may convert the combinable characters into a single character. Thus, the character string “a” and “{umlaut over ( )}” may be converted to “ä”.

FIG. 4D illustrates a flowchart of one embodiment of looking up a filename that may have characters that are not translatable into the encoding of the requesting process. In the illustrated embodiment, the multiple encoding module 160 attempts first to lookup filenames in the operations described above with reference to FIGS. 4A, 4B, and 4C, even if the filenames have untranslatable characters. In general, when looking up a filename with the same encoding as used to create the name, the filename will be successfully located, even if it includes untranslatable characters. When looking up a filename in a different encoding than the one used to create it, it may be necessary to perform a brute force search to locate the filename with untranslatable characters. In the illustrated embodiment, the brute force search is attempted second, after the normal lookup. In other embodiments, other suitable searches may be used either in place of or in addition to the searching described herein.

In state 462, the multiple encoding module 160 performs the lookup described above with reference to FIGS. 4A, 4B, and 4C. If the filename is found, as determined in state 464, then the multiple encoding module 160 returns the matching entry, in state 472. If the filename is not found, then the multiple encoding module 160 determines whether an untranslatable character is present in the filename, in state 466. If there is no untranslatable character(s), then the multiple encoding module 160 returns no entry, in state 474. If there is an untranslatable character, then the multiple encoding module 160 performs, in state 468, a brute force search for the filename in the directory's indexed data structure. In the illustrated embodiment, the multiple encoding module traverses the leaf nodes 242, comparing the filenames in the respective data elements 262 with the requested filename. This operation is described in more detail below with reference to FIG. 4E. If the filename is found, as determined in state 470, then the multiple encoding module 160 returns the matching entry. Otherwise, the multiple encoding module returns no entry, in state 474.

FIG. 4E illustrates a flowchart of one embodiment of performing a brute force search through a directory's indexed data structure. The multiple encoding module 160 performs the operations in the states between state 482 and state 496 for the entries in the directory's indexed data structure. For the operations between the states 482 and 496, the relevant entry is the current entry that the multiple encoding module 160 is performing the operations on. If, as determined in state 484, the encoding of the relevant entry is the same as the requester's encoding, then the multiple encoding module 160 proceeds to state 488. If the encoding of the relevant entry is not the same as the requester encoding, then the multiple encoding module 160, in state 486, converts the relevant entry to the requester's encoding.

If, as determined in state 488, the relevant entry matches the filename exactly, then the multiple encoding module 160 returns the relevant entry in state 490. If the relevant entry does not match the filename exactly, then the multiple encoding module 160 proceeds to state 492. If, as determined in state 492, an inexact match is wanted then the multiple encoding module 160 determines whether the relevant entry is a better match than in a previous entry(ies), and the multiple encoding module 160 remembers the best match, in state 494. If an inexact match is not wanted then the multiple encoding module 160 proceeds to the end of the operations repeated for the entries in the directory. After the entries in the directory have been evaluated, the multiple encoding module 160 determines whether an inexact match was found, in state 497. If an inexact match was found, as determined in state 497, then the multiple encoding module 160 returns the entries of the best match, in state 498. If no inexact match was found the multiple encoding module 160 returns a message indicating that no entry was found, in state 499.

The following exemplary pseudo code further illustrates embodiments of some of the methods described above:

/** * Make a string suitable for normalizing from a filename/encoding */ Regularize(filename, encoding)   If encoding is not UTF8     filenameout = filename converted to UTF8   else     filenameout = filename   For each utf-8 multibyte character in filenameout     If character is in regularization set       replace character with character it maps to   Perform Unicode normalization on filenameout   Convert filenameout to upper case   If filenameout contains the wildcard character     return (filenameout, true)   else     return (filenameout, false) ---------------------------------------------- /** * Hash a filename/encoding */ Hash(filename, encoding)   (hashstring, wildcard) = Regularize(filename, encoding)   hash = output of hash algorithm on hashstring   return (hash, wildcard) ---------------------------------------------- /** * Perform a filesystem lookup */ Lookup(dir, filename)     dowildcard = false     bestdirent = NULL     bestmatch = INFINITY     encoding = encoding setting of process issuing lookup   (hash, wildcard) = Hash(filename, encoding)   hashrange = [hash, hash]   Find the btree root from dir's inode back:   For each dirent in btree with key in range hashrange     If dirent.encoding != encoding       compare_name = dirent.fname converted to encoding     else       compare_name = dirent.fname     If compare_name bytewise identical to filename       return dirent     else if process wants inexact lookup(case insensitive, etc)       match = inexact_compare(compare_name, filename)       If (match < bestmatch)         bestmatch = match         bestdirent = dirent   If bestmatch != INFINITY     return bestdirent   If (willdcard and hashrange == [hash, hash])     hashrange = [0, MAXHASH]     goto back   Return ENOENT

V. Filenames

FIGS. 5A-1, 5A-2, 5B, 5C, 5D, 5E, and 5F illustrate embodiments of converting filenames from the original requester's encoding to a hashed value for indexing the filename in its respective directory's B−tree. FIG. 5A-1 illustrates the conversion operations for the character string “ä\”. In the EUC-JP encoding state 502 illustrates the byte values of the character string “ä\”, which are [143 171 163] and [92], respectively, in the EUC-JP encoding. In state 504, the native character string is converted to UTF-8. The byte value for “\” UTF-8 is the same as EUC-JP. In UTF-8, the byte values for “ä”, however, are [195, 164]. In state 506, problem characters are replaced. In the illustrated embodiment, the problem characters are “\” and “¥”, characters which are converted to “\”, so the character string remains unchanged. In state 508, the character string is converted to uppercase. Thus, the character “ä” is converted to “Ä”, which has the byte value of [195 132] in UTF-8. In state 510, the character string is normalized. In the illustrated embodiment, none of the characters are subject to normalization, leaving the character string unchanged. In state 512, the hash function is applied to the character string “Ä\”, yielding a hash value of 1500.

FIG. 5A-2 illustrates the conversion of character string “ä\” in the UTF-8 character encoding. State 514 illustrates the native byte values of the character string in UTF-8, which are [195 164] and [92], respectively. Because the requester's encoding is the same as the standard encoding, in the illustrated embodiment, the character string remains unchanged in state 516. State 518, 520, 522, and 524 follow the same conversion steps as illustrated in the corresponding states illustrated in FIG. 5A-1, as described above. Although the original character strings in FIGS. 5A-1 and 5A-2 have different character byte values, the character strings are the same. Because the different byte values represent identical character strings, the file system does not allow the creation of a second file with the identical name. Specifically, the filename of the first creator matches the filename of the second creator when the filename of the first creator is converted to the character encoding of the second creator. Thus, when the multiple encoding module 160 attempts to create the second file with the name “ä\”, in the process described above with reference to FIG. 3A, in some embodiments, the second identical filename will not be allowed. In some embodiments, filenames may collide regardless of the order in which the filenames are requested. In other embodiments, filenames may collide depending upon the order in which the filenames are requested.

FIG. 5B illustrates the conversion of the character string “ä\” in the UTF-8 character encoding to its respective hashed value. State 526 illustrates the native byte values for the character string in UTF-8, which are respectively [97] [204 136] [92]. In state 528, the character string remains the same because it is already in the UTF-8 encoding. In state 530, the character string also remains unchanged because there are no problem characters present. In state 532, the character “a” is converted to “A”, which has the byte value [65]. In state 534, the character string is normalized. Because the character “A” and “{umlaut over ( )}” may be combined, the character string is converted to “Ä\”, which has the byte values of [195 132] and [92], respectively. In state 536, the hash function is applied to the character string “Ä\”, which yields the value 1500. Because there is already a filename that hashes to the value 1500, the filename “ä\” is indexed as 1500,1 as illustrated in FIG. 2C.

FIG. 5C illustrates the conversion of the character string “ä¥” in the Latin-1 character encoding to a hashed value. State 538 illustrates the native byte values of the character string in Latin-1, which are [228] and [165], respectively. In state 540, the character string is converted to UTF-8, resulting in the byte values of [195 164] and [194 165], respectively. In state 542, problem characters are replaced. Because the “\” character and the “¥” are represented by the same byte values in some encodings, these characters are converted to a single character in UTF-8. Thus, the “¥” character is converted to the “\”, resulting in a character string of “ä\”. In state 544, the character “ä” is converted to the “Ä” character. In state 546, the character string remains the same because there are no characters to normalize. In state 548, the character string “Ä\” is hashed to the value 1500, similar to the examples illustrated in FIGS. 5A-1 and 5B. Because the file system already has two filenames that hashed to the value 1500, the index value for the character string “ä¥” is 1500,2.

FIG. 5D illustrates the conversion of “Ä\” in UTF-8 to a hashed value. State 550 illustrates the original byte values of the character string, which are [65] [204 136] and [92], respectively. In state 552, the character string remains the same because it is already in UTF-8. In state 554, the character string remains the same because there are no problem characters to replace. In state 556, the character string remains the same because there are no lower case characters to convert to upper case. In state 558, the combinable characters are normalized. Because “A” and “{umlaut over ( )}” may be combined, the character string is converted to “Ä\”, which results in the byte values of [195 132] [92]. In state 560, the character string “Ä\” is converted to the hashed value of 1500. Because the file system already has three filenames that hashed to 1500, the resulting index value for the character string “Ä\” is 1500,3.

FIG. 5E illustrates the conversion of the character string “EL” in the UTF-8 character encoding to a hash value. State 562 illustrates the original byte values of the character string, which are [69] and [76], respectively. In state 564, the character string remains the same because the requester's encoding was already in UTF-8. In state 566, the string remains the same because there are no replacement characters. In state 568, the character string remains the same because there are no lower case characters to convert to upper case. In state 570, the character string remains the same because there are no characters to normalize. In state 572, the character string “EL” is hashed to the value 1500. Although the previous character string that hashed to 1500, as illustrated in FIGS. 5A-1, 5E, 5C and 5D, comprise a character string “A”, it is possible for other character strings to hash to the same value. Thus, the example illustrated in FIG. 5E illustrates that two different character strings may hash to the same value. Because the file system already includes four filenames that hashed to the value 1500, the index for the character string “EL” is 1500,4.

FIG. 5F illustrates one embodiment of converting the filename “a[invalid]” in EUC-JP to a hashed value. State 574 illustrates the original byte values of the character string, which are [97], [150], and [92]. Although the byte value [150] is an invalid character in the EUC-JP encoding, the file system simply accepts the byte value. In FIG. 5F, the invalid character is illustrated with a string “[Invalid].” In state 576, the character string is converted to UTF-8. Because the characters “a” and “\” have the same byte values in UTF-8 and EUC-JP, there is no change to these characters. Furthermore, the byte value [150] is also invalid in UTF-8, and it remains unchanged. In state 578, the character string remains the same because there are no problem characters to be replaced. In state 580, the character “a” is converted to “A”. In state 582, the character string remains the same because there are no characters normalized. In state 584, the character string is hashed to the value 1500. As mentioned above, it is possible for different character strings to hash to the same value. Because the file system already includes five filenames that hashed the value 1500, the index or “key” value for the character string “a[invalid]” represented by the byte values [65] [150] [92] is 1500,5.

VII. Other Embodiments

Although the above-mentioned embodiments describe particular data structures and elements, it is recognized that a variety of data structures with various fields and data sets may be used. In addition, other embodiments of the flow charts may be used.

Furthermore, although the illustrated embodiments have described wildcard handling for untranslatable characters, and other special handling for round-trip problems (for example, yen and backslash), there are other special cases that are easily solved by the embodiments described herein, or trivial variations. For example, a translated name may become too long because of a system limit (such as 255 bytes per name). These and other anomalous edge cases that can be handled by the disclosed embodiments or simple adaptations thereof.

As discussed above, the features of embodiments disclosed herein may be combined with other systems, modules, and so forth. For example, the modules described herein may be combined, in some embodiments, with a module that provides a parallel set of file system interfaces that allow processes written for these interfaces to get the exact byte-string/encoding pairs from the file system. This kind of module may be desirable for backup to tape or for a remote file system. Furthermore, in the embodiments described above, the encoding tags are normally not visible to file system users and are generally inferred based on configurable settings for the particular access mechanism or client process. In other embodiments, the encoding may be provided directly (or indirectly) by the file system users. In some embodiments, respective encodings may be provided on a per filename basis. In other embodiments, the respective encodings may be specified for a particular set of file system operations. It will be appreciated by one skilled in the art that there are many suitable ways to receive or to discern respective character encodings of file system users.

While certain embodiments of the invention have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the present invention. Accordingly, the breadth and scope of the present invention should be defined in accordance with the following claims and their equivalents. 

1. A system for filename lookup that supports multiple character encodings, comprising: a computer system comprising a processor, a memory accessible by the processor, an indexed data structure stored on the memory, and at least one executable software module stored on the memory, wherein the at least one executable software module is executed by the processor, and wherein the at least one executable software module is configured to: receive a request from a first process to store a name into an indexed data structure, the name in a first character encoding; convert the name in the first character encoding into a first key, the first key based on a standard character encoding; store a data element associated with the first key into the indexed data structure, the data element comprising an encoding tag identifying the first character encoding, the byte values of the name in the first character encoding, and address data for locating file data associated with the name; receive a request from a second process to retrieve the data element, the request comprising the name in a second character encoding; convert the name in the second character encoding into a second key, the second key based on the standard character encoding; retrieve at least the address data of a data element indexed by the second key, from the indexed data structure if there is a data element indexed by the second key; and return at least the retrieved address data, if any, to the second process if there is a data element indexed by the second key.
 2. The system of claim 1, wherein the byte values of the name in the first character encoding comprise byte sequences that do not represent valid characters in the standard character encoding.
 3. The system of claim 1, wherein the at least one executable software module is further configured to store the indexed data structure in the memory of the computer system, the indexed data structure comprising one of the following: b−tree, binary tree, tree, b+tree, sorted tree, Patricia tries, red-black trees, and fiat-file directories.
 4. The system of claim 1, wherein said conversions comprise electronically converting the name in said first character encoding or said second character encoding respectively into a converted name in said standard character encoding and applying a hash function to the converted name to produce said first key or said second key respectively, said first key and said second key both comprising the same hash value.
 5. The system of claim 4, wherein said conversions further comprise regularizing the name before applying the hash function, the regularizing comprising one or more of the following: removing one or more problem characters, replacing one or more problem characters with one or more default characters, converting characters to a shared case, and normalizing.
 6. The system of claim 4, wherein said retrieval of at least the address data of the data element comprises: accessing a hash bucket associated with said hash value, the hash bucket comprising one or more data elements, each of the one or more data elements comprising an encoding tag identifying an associated character encoding, associated byte values, and associated address data; while no exact match is found, for each one of the one or more data elements which has an associated character encoding different from said second character encoding, converting the associated byte values from the associated character encoding into a converted name in the second character encoding and comparing the converted name in the second character encoding to said name in the second character encoding, and for each one of the one or more data elements which has an associated character encoding equivalent to said second character encoding, comparing the associated byte values with said name in the second character encoding; while no exact match is found, remembering the best matched data element; if an exact match is found, retrieving at least the address data of the data element associated with the exact match; and if no exact match is found, retrieving at least the address data of the data element associated with the best matched data element.
 7. The system of claim 1, wherein the at least one executable software module is further configured to infer said first character encoding from a first configurable setting associated with said first process and infer said second character encoding from a second configurable setting associated with said second process.
 8. The system of claim 1, wherein said name is a filename.
 9. The system of claim 1, wherein said name is a directory name.
 10. The system of claim 1, wherein the indexed data structure corresponds to a directory structure in a file system, the indexed data structure comprising multiple data elements, the data elements corresponding to files and directories in the directory structure.
 11. The system of claim 1, wherein the at least one executable software module is further configured to indicate to the second process that no match is found if there is no data element indexed by the second key.
 12. A method for filename lookup that supports multiple character encodings, comprising: storing, on a computer system, an indexed data structure, the computer system comprising a processor and memory; receiving, at the computer system, a request from a first process to store a name into an indexed data structure, the name in a first character encoding; converting, by the computer system, the name in the first character encoding into a first converted name in a standard character encoding; converting, by the computer system, the first converted name in the standard character encoding into a first key; storing a data element associated with the first key into the indexed data structure, the data element comprising an encoding tag identifying the first character encoding, the byte values of the name in the first character encoding, and address data for locating file data associated with the name; receiving a request, by the computer system, from a second process to retrieve the data element, the request comprising the name in a second character encoding; converting, by the computer system, the name in the second character encoding into a second converted name in a standard character encoding; converting, by the computer system, the second converted name in the standard character encoding into a second key; determining, by the computer system, whether one or more data elements within the indexed data structure correspond to the second key; if it is determined that one or more data elements within the indexed data structure correspond to the second key: traversing, by the computer system, one or more data elements within the indexed data structure that correspond to the second key; comparing, by the computer system, the name to the one or more data elements that correspond to the second key; determining, by the computer system, an exact match, if any, between the one or more data elements that correspond to the second key and the name; if an exact match is determined, returning, by the computer system, the data associated with the exact matched data element to the second process, otherwise if an exact match is not determined, determining, by the computer system, the best match between the one or more data elements that correspond to the second key and the name; and returning, by the computer system, data associated with the best matched data element to the second process.
 13. The method of claim 12, wherein said converting the first converted name in the standard character encoding comprises regularizing the first converted name according to one or more of the following: removing one or more problem characters, replacing one or more problem characters with one or more default characters, converting characters to a shared case, and normalizing.
 14. The method of claim 1, wherein the indexed data structure is one of the following: b−tree, binary tree, tree, b+tree, sorted tree, Patricia tries, red-black trees, and flat-file directories.
 15. The method of claim 12, wherein the one or more data elements that correspond to the second key comprise an associated character encoding and associated byte values, and said comparing comprises converting the associated byte values from the associated character encoding to the second character encoding.
 16. The method of claim 12, wherein the computer system is a distributed computer system operating on a cluster of computer nodes.
 17. The method of claim 12, further comprising inferring said first character encoding from a first configurable setting associated with said first process and inferring said second character encoding from a second configurable setting associated with said second process.
 18. The method of claim 12, further comprising, if there is a best matched data element and the address data in said best matched data element addresses directory data, identifying one or more filenames associated with said directory data and converting the one or more filenames to one or more converted filenames in the second character encoding; and wherein said returning comprises returning the one or more converted filenames to the second process.
 19. The method of claim 18, wherein converting the one or more filenames comprises converting one or more characters that are untranslatable to the second character encoding into one or more standard replacement characters.
 20. The method of claim 12, wherein said converting the second converted name in the standard character encoding comprises regularizing the second converted name according to one or more of the following: removing one or more problem characters, replacing one or more problem characters with one or more default characters, converting characters to a shared case, and normalizing.
 21. The method of claim 12, wherein said converting the first converted name in the standard character encoding comprises regularizing the first converted name according to one or more of the following: removing one or more problem characters, replacing one or more problem characters with one or more default characters, converting characters to a shared case, and normalizing, and wherein said converting the second converted name in the standard character encoding comprises regularizing the second converted name according to one or more of the following: removing one or more problem characters, replacing one or more problem characters with one or more default characters, converting characters to a shared case, and normalizing.
 22. The method of claim 12, further comprising: returning, by the computer system, an indication that no match is found if it is determined that no data elements within the indexed data structure correspond to the second key. 